Javrh, P. (ur.) - Obrazi pismenosti (Ljubljana, Andragoški center Slovenije, 2011)

University of Ljubljana System for Interspeech 2011 Speaker State Challenge

The paper presents our efforts in the Interspeech 2011 Speaker State Challenge. Both systems, for the Intoxication and the Sleepiness Sub-Challenge, are based on a Universal Background Model (UBM) in a form of a Hidden Markov Model (HMM), and the Maximum A Posteriori (MAP) adaptation. With the combination of our HMM-UBM-MAP derived supervectors and selected statistical functionals from the base...

NRG Ljubljana - reference manual

This is the reference manual for the “NRG Ljubljana” package for performing numerical renormalization group (NRG) calculations in quantum impurity physics. The manual provides the documentation for the input files (param and data) and the structure of the output files (td, custom, customfdm, spectral functions). There is also brief discussion about extending the capabilities of the program. Thi...

The Ljubljana Graph

The p-median and p-center Problems on Bipartite Graphs

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...

Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.